Dynamic Subdivision in Radiosity
نویسندگان
چکیده
This paper presents a fast radiosity algorithm for illuminating scenes containing large piecewise polygonal surfaces. Dynamic Subdivision is based on the well known Adaptive Subdivision, introduced by M.Cohen et al. [3]. During the illumination process, patches in areas with high intensity gradients are re ned. Contrary to Adaptive Subdivision, the presented algorithm subdivides patches not in a static way. The patch hierarchy is dynamic and adapted to the respective state of the illumination process. To take a decision concerning patch subdivision, more information about the gathered energy of a patch is considered than with Adaptive Subdivision. The results show that this new algorithm can lead to remarkable speedups compared to Adaptive Subdivision.
منابع مشابه
Fast Radiosity Using A Data Parallel Architecture
We present a data parallel algorithm for radiosity. The algorithm was designed to take advantage of large numbers of processors. It has been implemented on the Connection Machine CM2 system and scales linearly in the number of available processors over a wide range. All parts of the algorithm | form-factor computation, visibility determination, adaptive subdivision, and linear algebra solution ...
متن کاملOctant Priority for Radiosity Image Rendering
This paper presents a new scheme for image display using radiosity methods. An octree technique performs subdivision of polygons which is required in any radiosity method. The octree-based subdivision not only subdivides polygons into patches, but also produces a sequence of leaf octants implicitly sorted in the octree. By traversing the octree, a depth priority of these leaf octant,s with resp...
متن کاملUsing Subdivision on Hierarchical Data to Reconstruct Radiosity Distribution
Computing global illumination by finite element techniques usually generates a piecewise constant approximation of the radiosity distribution on surfaces. Directly displaying such scenes generates artefacts due to discretization errors. We propose to remedy this drawback by considering the piecewise constant output to be samples of a (piecewise) smooth function in object space and reconstruct t...
متن کاملDiscontinuity Meshing and Hierarchical MultiWavelet Radiosity
In this paper we propose an extension to the work of Lischinski et al [1] on combining hierarchical radiosity method and discontinuity meshing. The extension proposed here supports higher order radiosity function at the es timation s tep itself. We have carried out this extension using M ultiWavelet basis function s. Unlike th e multi-wavelet radiosity work of Gortler et al [2] which uses reg u...
متن کاملA New Hemisphere Subdivision Technique For Computing Radiosity
The hemisphere subdivision technique is an importancedriven technique using a triangular adaptive subdivision of a hemisphere in order to guide the rays shot from a patch [17]. The purpose of this technique is to take advantage of the knowledge of an environment in order to optimise the space distribution of rays shot in radiosity algorithms. In this paper, we present a new approach of the hemi...
متن کامل